Determining Influential Users with Supervised Random Walks
نویسندگان
چکیده
The emergence of social media and the enormous growth of social networks have initiated a great amount of research in social influence analysis. In this regard, many approaches take into account only structural information while a few have also incorporated content. In this study we propose a new method to rank users according to their topic-sensitive influence which utilizes a priori information by employing supervised random walks. We explore the use of supervision in a PageRank-like random walk while also exploiting textual information from the available content. We perform a set of experiments on Twitter datasets and evaluate our findings.
منابع مشابه
Maximum Consistency Preferential Random Walks
Random walk plays a significant role in computer science. The popular PageRank algorithm uses random walk. Personalized random walks force random walk to “personalized views” of the graph according to users’ preferences. In this paper, we show the close relations between different preferential random walks and label propagation methods used in semi-supervised learning. We further present a maxi...
متن کاملRandom walks on simplicial complexes and harmonics†
In this paper, we introduce a class of random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension d, a random walk with an absorbing state is defined which relates to the spectrum of the k-dimensional Laplacian for 1 ≤ k ≤ d. We study an example of random walks on simplicial complexes in the context of a semi-supervised learning problem. Specifically, we...
متن کاملSemi-supervised Classification from Discriminative Random Walks
This paper describes a novel technique, called D-walks, to tackle semi-supervised classification problems in large graphs. We introduce here a betweenness measure based on passage times during random walks of bounded lengths. Such walks are further constrained to start and end in nodes within the same class, defining a distinct betweenness for each class. Unlabeled nodes are classified accordin...
متن کاملA framework for validating the merit of properties that predict the influence of a twitter user
What characterizes an influential user? While there is much research on finding the concrete influential members of a social network, there are less findings about the properties distinguishing between an influential and a non-influential user. A major challenge is the absence of a ground truth, on which supervised learning can be performed. In this study, we propose a complete framework for su...
متن کاملClassification in Graphs using Discriminative Random Walks
This paper describes a novel technique, called D-walks, to tackle semi-supervised classification problems in large graphs. We introduce here a betweenness measure based on passage times during random walks of bounded lengths in the input graph. The class of unlabeled nodes is predicted by maximizing the betweenness with labeled nodes. This approach can deal with directed or undirected graphs wi...
متن کامل